Jacobi Matrices and Boundary Value Problems in Distance-regular Graphs∗
نویسندگان
چکیده
In this work we analyze regular boundary value problems on a distance-regular graph associated with Schrödinger operators. These problems include the cases in which the boundary has two or one vertices. Moreover, we obtain the Green matrix for each regular problem. In each case, the Green matrices are given in terms of two families of orthogonal polynomials one of them corresponding with the distance polynomials of the distance-regular graphs.
منابع مشابه
Ela Jacobi Matrices and Boundary Value Problems in Distance-regular Graphs
Regular boundary value problems on a distance-regular graph associated with Schrödinger operators are analyzed. These problems include the cases in which the boundary has one or two vertices. In each case, the Green matrices are given in terms of two families of orthogonal polynomials, one of them corresponding with the distance polynomials of the distance-regular graphs.
متن کاملJacobi matices and boundary value problems in distance-regular graphs
Regular boundary value problems on a distance-regular graph associated with Schrödinger operators are analyzed. These problems include the cases in which the boundary has one or two vertices. In each case, the Green matrices are given in terms of two families of orthogonal polynomials, one of them corresponding with the distance polynomials of the distance-regular graphs.
متن کاملAn Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme
We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...
متن کاملBounds on the first non-null eigenvalue for self-adjoint boundary value problems on networks
We aim here at obtaining bounds on the first non-null eigenvalue for self-adjoint boundary value problems on a weighted network by means of equilibrium measures, that includes the study of Dirichlet, Neumann and Mixed problems. We also show the sharpness of these bounds throughout the analysis of some known examples. In particular, we emphasize the case of distance-regular graphs, and we show t...
متن کاملBounds on the First Nonzero Eigen- Value for Self-adjoint Boundary Value Problems on Networks
We aim here at obtaining bounds on the first nonzero eigenvalue for selfadjoint boundary value problems on a weighted network by means of equilibrium measures, that include the study of Dirichlet, Neumann and Mixed problems. We also show the sharpness of these bounds throughout the analysis of some examples. In particular we emphasize the case of distance-regular graphs and we show that the obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012